a(x1) → b(c(x1))
a(b(x1)) → b(a(x1))
d(c(x1)) → d(a(x1))
a(c(x1)) → c(a(x1))
↳ QTRS
↳ DependencyPairsProof
a(x1) → b(c(x1))
a(b(x1)) → b(a(x1))
d(c(x1)) → d(a(x1))
a(c(x1)) → c(a(x1))
D(c(x1)) → A(x1)
A(c(x1)) → A(x1)
D(c(x1)) → D(a(x1))
A(b(x1)) → A(x1)
a(x1) → b(c(x1))
a(b(x1)) → b(a(x1))
d(c(x1)) → d(a(x1))
a(c(x1)) → c(a(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
D(c(x1)) → A(x1)
A(c(x1)) → A(x1)
D(c(x1)) → D(a(x1))
A(b(x1)) → A(x1)
a(x1) → b(c(x1))
a(b(x1)) → b(a(x1))
d(c(x1)) → d(a(x1))
a(c(x1)) → c(a(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
A(c(x1)) → A(x1)
A(b(x1)) → A(x1)
a(x1) → b(c(x1))
a(b(x1)) → b(a(x1))
d(c(x1)) → d(a(x1))
a(c(x1)) → c(a(x1))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A(c(x1)) → A(x1)
A(b(x1)) → A(x1)
The value of delta used in the strict ordering is 16.
POL(c(x1)) = 4 + (4)x_1
POL(A(x1)) = (4)x_1
POL(b(x1)) = 4 + x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
a(x1) → b(c(x1))
a(b(x1)) → b(a(x1))
d(c(x1)) → d(a(x1))
a(c(x1)) → c(a(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
D(c(x1)) → D(a(x1))
a(x1) → b(c(x1))
a(b(x1)) → b(a(x1))
d(c(x1)) → d(a(x1))
a(c(x1)) → c(a(x1))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
D(c(x1)) → D(a(x1))
The value of delta used in the strict ordering is 9.
POL(c(x1)) = 4 + (4)x_1
POL(D(x1)) = (3)x_1
POL(a(x1)) = 1 + (2)x_1
POL(b(x1)) = 0
a(x1) → b(c(x1))
a(b(x1)) → b(a(x1))
a(c(x1)) → c(a(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
a(x1) → b(c(x1))
a(b(x1)) → b(a(x1))
d(c(x1)) → d(a(x1))
a(c(x1)) → c(a(x1))